全文获取类型
收费全文 | 1022篇 |
免费 | 124篇 |
国内免费 | 15篇 |
专业分类
化学 | 66篇 |
晶体学 | 3篇 |
力学 | 10篇 |
综合类 | 55篇 |
数学 | 840篇 |
物理学 | 187篇 |
出版年
2023年 | 20篇 |
2022年 | 39篇 |
2021年 | 53篇 |
2020年 | 24篇 |
2019年 | 34篇 |
2018年 | 25篇 |
2017年 | 52篇 |
2016年 | 43篇 |
2015年 | 33篇 |
2014年 | 84篇 |
2013年 | 79篇 |
2012年 | 61篇 |
2011年 | 46篇 |
2010年 | 57篇 |
2009年 | 59篇 |
2008年 | 47篇 |
2007年 | 71篇 |
2006年 | 37篇 |
2005年 | 43篇 |
2004年 | 27篇 |
2003年 | 24篇 |
2002年 | 34篇 |
2001年 | 25篇 |
2000年 | 22篇 |
1999年 | 8篇 |
1998年 | 12篇 |
1997年 | 7篇 |
1996年 | 8篇 |
1995年 | 7篇 |
1994年 | 7篇 |
1993年 | 7篇 |
1992年 | 6篇 |
1991年 | 7篇 |
1990年 | 3篇 |
1989年 | 4篇 |
1988年 | 8篇 |
1987年 | 4篇 |
1986年 | 2篇 |
1985年 | 5篇 |
1984年 | 5篇 |
1983年 | 3篇 |
1982年 | 4篇 |
1981年 | 2篇 |
1980年 | 2篇 |
1978年 | 2篇 |
1977年 | 2篇 |
1976年 | 3篇 |
1971年 | 1篇 |
1970年 | 1篇 |
1957年 | 1篇 |
排序方式: 共有1161条查询结果,搜索用时 125 毫秒
11.
12.
Silvia Lorenzo-Freire José M. Alonso-Meijide Balbina Casas-Méndez Ruud Hendrickx 《European Journal of Operational Research》2007
Calleja et al. [Calleja, P., Borm, P., Hendrickx, R., 2005. Multi-issue allocation situations. European Journal of Operational Research 164, 730–747] introduced multi-issue allocation situations with awards. In this paper, we extend the classical model of cooperative games with transferable utility to the cooperative games with transferable utility and awards. We define a run-to-the-bank rule for cooperative games with transferable utility and awards and characterise it in terms of a property of balanced contributions. We apply our main result to bankruptcy problems and multi-issue allocation situations with awards. 相似文献
13.
14.
This paper proposes a perturbation-based heuristic for the capacitated multisource Weber problem. This procedure is based on an effective use of borderline customers. Several implementations are considered and the two most appropriate are then computationally enhanced by using a reduced neighbourhood when solving the transportation problem. Computational results are presented using data sets from the literature, originally used for the uncapacitated case, with encouraging results. 相似文献
15.
Estimating market shares in each market segment using the information entropy concept 总被引:3,自引:0,他引:3
Sales data of a certain product for the various competitors are usually available at the aggregate level. However these data give no clue to the heterogeneities in the sales pattern across different market segments. Heterogeneities are caused by different purchasing behavior in each market segment; as a purchaser in a segment will be attracted to the attributes of the product most important to that segment. This concept can be formalized via a simple attraction model that utilizes an elasticity measure for each quality or price attribute [G.S. Carpenter, L.G. Cooper, D.M. Hanssens, D.F. Midgley, Modeling asymmetric competition, Marketing Science 7 (4) (1998) 393–412]. Assessment of these elasticities is not difficult since customer response – in each market segment – to perception of quality and price is tracked by most firms [J. Ross, D. Georgoff, A survey of productive and quality issues in manufacturing. The state of the industry, Industrial Management 3 (5) (1991) 22–25]. This paper attempts to formulate a generic framework based on the information entropy concept that utilizes such an attraction model to estimate competitors’ sales in each market segment. 相似文献
16.
This paper studied the cost allocation for the unfunded liability in a defined benefit pension scheme incorporating the stochastic phenomenon of its returns. In the recent literature represented by Cairns and Parker [Insurance: Mathematics and Economics 21 (1997) 43], Haberman [Insurance: Mathematics and Economics 11 (1992) 179; Insurance: Mathematics and Economics 13 (1993) 45; Insurance: Mathematics and Economics 14 (1994) 219; Insurance: Mathematics and Economics 14 (1997) 127], Owadally and Haberman [North American Actuarial Journal 3 (1999) 105], the fund level is modeled based on the plan dynamics and the returns are generated through several stochastic processes to reflect the current realistic economic perspective to see how the contribution changed as the cost allocation period increased. In this study, we generalize the previous constant value assumption in cost amortization by modeling the returns and valuation rates simultaneously. Taylor series expansion is employed to approximate the unconditional and conditional moments of the plan contribution and fund level. Hence the stability of the plan contribution and the fund size under different allocation periods could be estimated, which provide valuable information adding to the previous works. 相似文献
17.
Robert S. Maier 《Random Structures and Algorithms》1991,2(4):379-420
We analyze the performance of a prototypical scheme for shared storage allocation: two initially empty stacks evolving in a contiguous block of memory of size m. We treat the case in which the stacks are more likely to shrink than grow, but with the probabilities of insertion and deletion allowed to depend arbitrarily on stack height as a fraction of m. New results are obtained on the m → ∞ asymptotics of the stack collision time, and of the final stack heights. The results of Wentzell and Freidlin on the large deviations of Markov chains are used, and the relation of their formalism to the Hamiltonian formulation of classical mechanics is emphasized. Certain results on higher-order asymptotics follow from WKB expansions. 相似文献
18.
带到达时间的单机排序中的资源分配问题 总被引:1,自引:0,他引:1
讨论两个单机排序的资源分配问题1|rj,pj=bj-ajuj,Cmax≤|∑uj和1|rj,prec,pj=bj-ajuj C max≤|∑uj并给出求其最优资源分配的多项式算法. 相似文献
19.
We introducegeneral starvation and consider cyclic networks withgeneral blocking and starvation (GBS). The mechanism of general blocking allows the server to process a limited number of jobs when the buffer downstream is full, and that of general starvation allows the server to perform a limited number of services in anticipation of jobs that are yet to arrive. The two main goals of this paper are to investigate how the throughput of cyclic GBS networks is affected by varying (1) the total number of jobsJ, and (2) the buffer allocationk=(k1..., km) subject to a fixed total buffer capacityK=k
1 +... + km. In particular, we obtain sufficient conditions for the throughput to be symmetric inJ and to be maximized whenJ=K/2. We also show that the equal buffer allocation is optimal under the two regimes of light or heavy usage. In order to establish these results, we obtain several intermediate structural properties of the throughput, using duality, reversibility, and concavity, which are of independent interest.Research supported in part by NSF Grant No. ECS-8919818. 相似文献
20.
This paper studies a supply chain consisting of two suppliers and one retailer in a spot market, where the retailer uses the
newsvendor solution as its purchase policy, and suppliers compete for the retailer’s purchase. Since each supplier’s bidding
strategy affects the other’s profit, a game theory approach is used to identify optimal bidding strategies. We prove the existence
and uniqueness of a Nash solution. It is also shown that the competition between the supplier leads to a lower market clearing
price, and as a result, the retailer benefits from it. Finally, we demonstrate the applicability of the obtained results by
deriving optimal bidding strategies for power generator plants in the deregulated California energy market.
Supported in part by RGC (Hong Kong) Competitive Earmarked Research Grants (CUHK4167/04E and CUHK4239/03E), a Distinguished
Young Investigator Grant from the National Natural Sciences Foundation of China, and a grant from Hundred Talents Program
of the Chinese Academy of Sciences. 相似文献